[20251215] BOJ / G5 / 넴모넴모 (Easy) / 설진영 #1683
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/14712
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N×M 격자판에 "넴모"를 배치하는 게임
2×2 정사각형을 이루는 네 칸 모두에 넴모가 있으면 안 됨
이 조건을 만족하는 모든 배치의 가짓수를 구하는 문제
🔍 풀이 방법
백트래킹을 활용한 브루트포스 탐색
2×2 검사를 현재 칸 기준 좌상단 방향으로만 확인하면 됨
⏳ 회고
낫뱃